Flow Management in Packet Networks Through Interacting Queues and Law-of-Mass-Action Scheduling

نویسندگان

  • Thomas Meyer
  • Christian Tschudin
چکیده

Classical queueing disciplines are work conserving: From the allocated channel’s perspective this makes sense as the full bandwidth is exploited by sending packets back-to-back. But formally and traffic engineering wise, the resulting network dynamics is difficult to handle. In this report, we show that deviating from this fundamental queuing assumption leads to much more controllable and analyzable forms of protocols. At the core of our work is a queue-scheduling discipline based on the chemical “Law of Mass Action” (LoMA) that serves a queue with a rate proportional to its fill level. We introduce our LoMA-scheduling approach and provide a solid mathematical framework adopted from chemistry that simplifies the analysis of the corresponding queueing networks, including the prediction of the underlying protocols’ dynamics. We demonstrate the elegance of our model by implementing and analyzing a TCP-compatible “chemical” congestion control algorithm C3A with only a few interacting queues (another novelty of our approach). We also show the application of our theory to gossip protocols, explain an effective implementation of the scheduler and discuss possibilities of how to integrate mass-action scheduling into traditional networking environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

Competitive Analysis of Constrained Queueing Systems

We consider the classical problem of constrained queueing (or switched networks): There is a set of N queues to which unit sized packets arrive. The queues are interdependent, so that at any time step, only a subset of the queues can be activated. One packet from each activated queue can be transmitted, and leaves the system. The set of feasible subsets that can be activated, denoted S, is down...

متن کامل

Priority based Packet Scheduling Approach for Wireless Sensor Networks

A priority based packet scheduling scheme is proposed which aims at scheduling different types of data packets, such as real time and non-real-time data packets at sensor nodes with resource constraints in Wireless Sensor Networks. Most of the existing packet-scheduling mechanisms of Wireless Sensor Networks use First Come First Served (FCFS), non-preemptive priority and preemptive priority sch...

متن کامل

Efficient Dynamic Multilevel Priority Task Scheduling For Wireless Sensor Networks

ABSTRACT: Most of the existing packet-scheduling mechanism of WSN use First Come First Served(FCFS),nonpreemptive priority and preemptive prior it scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dy...

متن کامل

Instability Phenomena in Underloaded Packet Networks with QoS Schedulers

Instability in packet networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the literature. Underload instabilities can be produced either by customer routes that visit several time...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011